A vertex critical graph without critical edges
نویسندگان
چکیده
منابع مشابه
Making a Graph Crossing-Critical by Multiplying its Edges
A graph is crossing-critical if the removal of any of its edges decreases its crossing number. This work is motivated by the following question: to what extent is crossingcriticality a property that is inherent to the structure of a graph, and to what extent can it be induced on a noncritical graph by multiplying (all or some of) its edges? It is shown that if a nonplanar graph G is obtained by...
متن کاملDense critical and vertex-critical graphs
This paper gives new constructions of k-chromatic critical graphs with high minimum degree and high edge density, and of vertex-critical graphs with high edge density. c © 2002 Elsevier Science B.V. All rights reserved.
متن کاملVertex-disjoint cycles containing specified edges in a bipartite graph
Dirac and Ore-type degree conditions are given for a bipartite graph to contain vertex disjoint cycles each of which contains a previously specified edge. This solves a conjecture of Wang in [6].
متن کاملON VERTEX b-CRITICAL TREES
A b-coloring is a proper coloring of the vertices of a graph such that each color class has a vertex that has neighbors of all other colors. The b-chromatic number of a graph G is the largest k such that G admits a b-coloring with k colors. A graph G is b-critical if the removal of any vertex of G decreases the b-chromatic number. We prove various properties of b-critical trees. In particular, ...
متن کاملRegular vertex diameter critical graphs
A graph is called vertex diameter critical if its diameter increases when any vertex is removed. Regular vertex diameter critical graphs of every valency k ≥ 2 and diameter d ≥ 2 exist, raising the question of identifying the smallest such graphs. We describe an infinite family of k-regular vertex diameter critical graphs of diameter d with at most kd+ (2k − 3) vertices. This improves the previ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1992
ISSN: 0012-365X
DOI: 10.1016/0012-365x(92)90354-i